Solving Mathematical Programs with Equilibrium Constraints
نویسندگان
چکیده
This paper aims at developing effective numerical methods for solving mathematical programs with equilibrium constraints. Due to the existence of complementarity constraints, the usual constraint qualifications do not hold at any feasible point, and there are various stationarity concepts such as Clarke, Mordukhovich, and strong stationarities that are specially defined for mathematical programs with equilibrium constraints. However, since these stationarity systems contain some unknown index sets, there has been no numerical method for solving them directly. In this paper, we remove the unknown index sets from these stationarity systems successfully and reformulate them as smooth equations with box constraints. We further present a modified Levenberg-Marquardt method for solving these constrained equations. We show that, under some weak local error bound conditions, the method is locally and superlinearly convergent. Furthermore, we give some sufficient conditions for local error bounds and show that these conditions are not very stringent by a number of examples.
منابع مشابه
A Merit Function Piecewise SQP Algorithm for Solving Mathematical Programs with Equilibrium Constraints∗
In this paper we propose a merit function piecewise SQP algorithm for solving mathematical programs with equilibrium constraints (MPECs) formulated as mathematical programs with complementarity constraints. Under some mild conditions, the new algorithm is globally convergent to a piecewise stationary point. Moreover if the partial MPECLICQ is satisfied at the accumulation point then the accumul...
متن کاملEntropic Regularization Approach for Mathematical Programs with Equilibrium Constraints
A new smoothing approach based on entropic perturbation is proposed for solving mathematical programs with equilibrium constraints. Some of the desirable properties of the smoothing function are shown. The viability of the proposed approach is supported by a computational study on a set of well-known test problems.
متن کاملSome Feasibility Issues in Mathematical Programs with Equilibrium Constraints
This paper is concerned with some feasibility issues in mathematical programs with equilibrium constraints (MPECs) where additional joint constraints are present that must be satis ed by the state and design variables of the problems. We introduce su cient conditions that guarantee the feasibility of these MPECs. It turns out that these conditions also guarantee the feasibility of the quadratic...
متن کاملSolving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization
In this paper, we consider the stochastic mathematical programs with equilibrium constraints, which includes two kinds of models called here-and-now and lower-level wait-andsee problems. We present a combined smoothing implicit programming and penalty method for the problems with a finite sample space. Then, we suggest a quasi-Monte Carlo approximation method for solving a problem with continuo...
متن کاملAn efficient modified neural network for solving nonlinear programming problems with hybrid constraints
This paper presents the optimization techniques for solving convex programming problems with hybrid constraints. According to the saddle point theorem, optimization theory, convex analysis theory, Lyapunov stability theory and LaSalleinvariance principle, a neural network model is constructed. The equilibrium point of the proposed model is proved to be equivalent to the optima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Optimization Theory and Applications
دوره 166 شماره
صفحات -
تاریخ انتشار 2015